Complexity, Depth, and Sophistication

نویسنده

  • Moshe Koppel
چکیده

T wo measures of the "meaningful" complexity of an infini te string are shown to be equivalent up to a constant (under app ropriate translati on) . "Sophis t ica tion", defined by Koppel and Atlan [3], is the size of t he projectible par t of the st ring's minimal description and forma lizes t he amount of pla nni ng which wen t into t he constru ct ion of the str ing. "Dept h". defi ned by Bennett til, is the amou nt of t ime required for the str ing to be generated from its min ima l descr iptio n and form alizes its "evolvedness. "

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Relationship between Syntactic and Lexical Complexity in Speech Monologues of EFL Learners

: This study aims to explore the relationship between syntactic and lexical complexity and also the relationship between different aspects of lexical complexity. To this end, speech monologs of 35 Iranian high-intermediate learners of English on three different tasks (i.e. argumentation, description, and narration) were analyzed for correlations between one measure of sy...

متن کامل

Information measures for infinite sequences

We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defined the sophistication of an object as the length of the shortest total program that given some data as input produces it and the sum of the size of the program with the size of the data is as consice as the smallest de...

متن کامل

The Limits of Decidable States on Open-Ended Evolution and Emergence

Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended evolution and the adaptability of computable dynamical systems. Within this framework, we show that decidability imposes absolute limits to the stable growth of complexity in computable dynamical systems. Conversely, ...

متن کامل

Approximations of Algorithmic and Structural Complexity Validate Cognitive-behavioural Experimental Results

We apply methods for estimating the algorithmic complexity of sequences to behavioural sequences of three landmark studies of animal behavior each of increasing sophistication, including foraging communication by ants, flight patterns of fruit flies, and tactical deception and competition strategies in rodents. In each case, we demonstrate that approximations of Logical Depth and Kolmogorv-Chaitin

متن کامل

Measuring Static Complexity

The concept of "pattern" is introduced, formally defined, and used to analyze various measures of the complexity of finite binary sequences and other objects. The standard Kolmogoroff.Chaitin.Solomonoff complexity measure is considered, along with Bennett’s ’logical depth; Koppel’s "sophistication’, and Chaitin’s analysis ofthe complexity of geometric objects. The pattern.theoretic point of vie...

متن کامل

Sophisticated Infinite Sequences

In this paper we revisit the notion of sophistication for infinite sequences. Koppel defined sophistication of an object as the length of the shortest (finite) total program (p) that with some (finite or infinite) data (d) produce it and |p|+ |d| is smaller than the shortest description of the object plus a constant. However the notion of “description of infinite sequences” is not appropriately...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Complex Systems

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1987